TSTP Solution File: NUM636^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM636^2 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:13:38 EDT 2024
% Result : Theorem 0.17s 0.38s
% Output : Refutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM636^2 : TPTP v8.1.2. Released v3.7.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri May 3 14:32:31 EDT 2024
% 0.17/0.34 % CPUTime :
% 0.17/0.34 This is a TH0_THM_EQU_NAR problem
% 0.17/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.iWCXoJdCP5/Vampire---4.8_20057
% 0.17/0.36 % (20169)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.17/0.36 % (20170)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.17/0.36 % (20168)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.17/0.36 % (20171)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.17/0.36 % (20172)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.17/0.36 % (20173)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.17/0.36 % (20174)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.17/0.36 % (20170)Instruction limit reached!
% 0.17/0.36 % (20170)------------------------------
% 0.17/0.36 % (20170)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (20170)Termination reason: Unknown
% 0.17/0.36 % (20171)Instruction limit reached!
% 0.17/0.36 % (20171)------------------------------
% 0.17/0.36 % (20171)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (20171)Termination reason: Unknown
% 0.17/0.36 % (20171)Termination phase: Saturation
% 0.17/0.36
% 0.17/0.36 % (20171)Memory used [KB]: 5500
% 0.17/0.36 % (20171)Time elapsed: 0.003 s
% 0.17/0.36 % (20171)Instructions burned: 2 (million)
% 0.17/0.36 % (20171)------------------------------
% 0.17/0.36 % (20171)------------------------------
% 0.17/0.36 % (20170)Termination phase: Saturation
% 0.17/0.36
% 0.17/0.36 % (20170)Memory used [KB]: 5500
% 0.17/0.36 % (20170)Time elapsed: 0.003 s
% 0.17/0.36 % (20172)Refutation not found, incomplete strategy
% 0.17/0.36 % (20172)------------------------------
% 0.17/0.36 % (20172)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (20170)Instructions burned: 2 (million)
% 0.17/0.36 % (20170)------------------------------
% 0.17/0.36 % (20170)------------------------------
% 0.17/0.36 % (20172)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.36
% 0.17/0.36
% 0.17/0.36 % (20172)Memory used [KB]: 5500
% 0.17/0.36 % (20172)Time elapsed: 0.003 s
% 0.17/0.36 % (20172)Instructions burned: 1 (million)
% 0.17/0.36 % (20172)------------------------------
% 0.17/0.36 % (20172)------------------------------
% 0.17/0.36 % (20169)Refutation not found, incomplete strategy
% 0.17/0.36 % (20169)------------------------------
% 0.17/0.36 % (20169)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (20169)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.36
% 0.17/0.36
% 0.17/0.36 % (20169)Memory used [KB]: 5500
% 0.17/0.36 % (20169)Time elapsed: 0.003 s
% 0.17/0.36 % (20169)Instructions burned: 2 (million)
% 0.17/0.36 % (20169)------------------------------
% 0.17/0.36 % (20169)------------------------------
% 0.17/0.36 % (20168)Instruction limit reached!
% 0.17/0.36 % (20168)------------------------------
% 0.17/0.36 % (20168)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (20167)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.17/0.36 % (20168)Termination reason: Unknown
% 0.17/0.36 % (20168)Termination phase: Saturation
% 0.17/0.36
% 0.17/0.36 % (20168)Memory used [KB]: 5500
% 0.17/0.36 % (20168)Time elapsed: 0.004 s
% 0.17/0.36 % (20168)Instructions burned: 4 (million)
% 0.17/0.36 % (20168)------------------------------
% 0.17/0.36 % (20168)------------------------------
% 0.17/0.36 % (20174)Instruction limit reached!
% 0.17/0.36 % (20174)------------------------------
% 0.17/0.36 % (20174)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (20174)Termination reason: Unknown
% 0.17/0.36 % (20174)Termination phase: Saturation
% 0.17/0.36
% 0.17/0.36 % (20174)Memory used [KB]: 5500
% 0.17/0.36 % (20174)Time elapsed: 0.004 s
% 0.17/0.36 % (20174)Instructions burned: 3 (million)
% 0.17/0.36 % (20174)------------------------------
% 0.17/0.36 % (20174)------------------------------
% 0.17/0.37 % (20173)Instruction limit reached!
% 0.17/0.37 % (20173)------------------------------
% 0.17/0.37 % (20173)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.37 % (20173)Termination reason: Unknown
% 0.17/0.37 % (20173)Termination phase: Saturation
% 0.17/0.37
% 0.17/0.37 % (20173)Memory used [KB]: 5628
% 0.17/0.37 % (20173)Time elapsed: 0.012 s
% 0.17/0.37 % (20173)Instructions burned: 19 (million)
% 0.17/0.37 % (20173)------------------------------
% 0.17/0.37 % (20173)------------------------------
% 0.17/0.38 % (20167)First to succeed.
% 0.17/0.38 % (20175)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on Vampire---4 for (2999ds/37Mi)
% 0.17/0.38 % (20177)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.17/0.38 % (20180)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on Vampire---4 for (2999ds/7Mi)
% 0.17/0.38 % (20181)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on Vampire---4 for (2999ds/16Mi)
% 0.17/0.38 % (20176)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on Vampire---4 for (2999ds/15Mi)
% 0.17/0.38 % (20167)Refutation found. Thanks to Tanya!
% 0.17/0.38 % SZS status Theorem for Vampire---4
% 0.17/0.38 % SZS output start Proof for Vampire---4
% 0.17/0.38 thf(func_def_1, type, succ: $i > $i).
% 0.17/0.38 thf(func_def_5, type, sK0: ($i > $o) > $i).
% 0.17/0.38 thf(func_def_9, type, ph3: !>[X0: $tType]:(X0)).
% 0.17/0.38 thf(f242,plain,(
% 0.17/0.38 $false),
% 0.17/0.38 inference(equality_resolution,[],[f240])).
% 0.17/0.38 thf(f240,plain,(
% 0.17/0.38 ( ! [X0 : $i] : ((sK1 != X0)) )),
% 0.17/0.38 inference(trivial_inequality_removal,[],[f234])).
% 0.17/0.38 thf(f234,plain,(
% 0.17/0.38 ( ! [X0 : $i] : ((one != one) | (sK1 != sK1) | (sK1 != X0)) )),
% 0.17/0.38 inference(superposition,[],[f24,f217])).
% 0.17/0.38 thf(f217,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : ((one = X0) | (sK1 != X0) | (X0 != X1)) )),
% 0.17/0.38 inference(equality_proxy_clausification,[],[f216])).
% 0.17/0.38 thf(f216,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : ((sK1 != X0) | (one = X0) | ((X0 = X1) = $false)) )),
% 0.17/0.38 inference(not_proxy_clausification,[],[f215])).
% 0.17/0.38 thf(f215,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : ((sK1 != X0) | (one = X0) | ($true = (~ (X0 = X1)))) )),
% 0.17/0.38 inference(duplicate_literal_removal,[],[f214])).
% 0.17/0.38 thf(f214,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : ((one = X0) | (one = X0) | (sK1 != X0) | ($true = (~ (X0 = X1)))) )),
% 0.17/0.38 inference(equality_proxy_clausification,[],[f213])).
% 0.17/0.38 thf(f213,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : ((one = X0) | (sK1 != X0) | ((X0 = one) = $true) | ($true = (~ (X0 = X1)))) )),
% 0.17/0.38 inference(not_proxy_clausification,[],[f212])).
% 0.17/0.38 thf(f212,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : ((one = X0) | (sK1 != X0) | ($true != (~ (X0 = one))) | ($true = (~ (X0 = X1)))) )),
% 0.17/0.38 inference(duplicate_literal_removal,[],[f211])).
% 0.17/0.38 thf(f211,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : ((sK1 != X0) | ($true != (~ (X0 = one))) | (one = X0) | (sK1 != X0) | ($true = (~ (X0 = X1)))) )),
% 0.17/0.38 inference(equality_proxy_clausification,[],[f210])).
% 0.17/0.38 thf(f210,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : (((X0 = sK1) = $false) | (one = X0) | ($true = (~ (X0 = X1))) | (sK1 != X0) | ($true != (~ (X0 = one)))) )),
% 0.17/0.38 inference(not_proxy_clausification,[],[f209])).
% 0.17/0.38 thf(f209,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : (($true = (~ (X0 = sK1))) | (one = X0) | ($true = (~ (X0 = X1))) | ($true != (~ (X0 = one))) | (sK1 != X0)) )),
% 0.17/0.38 inference(beta_eta_normalization,[],[f190])).
% 0.17/0.38 thf(f190,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : ((sK1 != X0) | ($true = ((^[Y0 : $i]: (~ (X0 = Y0))) @ sK1)) | (one = X0) | (((^[Y0 : $i]: (~ (X0 = Y0))) @ X1) = $true) | ($true != ((^[Y0 : $i]: (~ (X0 = Y0))) @ one))) )),
% 0.17/0.38 inference(superposition,[],[f20,f133])).
% 0.17/0.38 thf(f133,plain,(
% 0.17/0.38 ( ! [X0 : $i] : ((sK1 = (sK0 @ (^[Y0 : $i]: (~ (X0 = Y0))))) | (one = X0) | (sK1 != X0)) )),
% 0.17/0.38 inference(superposition,[],[f25,f66])).
% 0.17/0.38 thf(f66,plain,(
% 0.17/0.38 ( ! [X0 : $i] : (((succ @ (sK0 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0) | (one = X0)) )),
% 0.17/0.38 inference(equality_proxy_clausification,[],[f65])).
% 0.17/0.38 thf(f65,plain,(
% 0.17/0.38 ( ! [X0 : $i] : (((succ @ (sK0 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0) | ((X0 = one) = $true)) )),
% 0.17/0.38 inference(not_proxy_clausification,[],[f64])).
% 0.17/0.38 thf(f64,plain,(
% 0.17/0.38 ( ! [X0 : $i] : (((succ @ (sK0 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0) | ($true != (~ (X0 = one)))) )),
% 0.17/0.38 inference(beta_eta_normalization,[],[f57])).
% 0.17/0.38 thf(f57,plain,(
% 0.17/0.38 ( ! [X0 : $i] : (($true != ((^[Y0 : $i]: (~ (X0 = Y0))) @ one)) | ((succ @ (sK0 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0)) )),
% 0.17/0.38 inference(leibniz_equality_elimination,[],[f21])).
% 0.17/0.38 thf(f21,plain,(
% 0.17/0.38 ( ! [X2 : $i,X0 : $i > $o] : (((X0 @ (succ @ (sK0 @ X0))) != $true) | ((X0 @ X2) = $true) | ((X0 @ one) != $true)) )),
% 0.17/0.38 inference(cnf_transformation,[],[f15])).
% 0.17/0.38 thf(f15,plain,(
% 0.17/0.38 ! [X0 : $i > $o] : ((((X0 @ (succ @ (sK0 @ X0))) != $true) & ((X0 @ (sK0 @ X0)) = $true)) | ((X0 @ one) != $true) | ! [X2] : ((X0 @ X2) = $true))),
% 0.17/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f14])).
% 0.17/0.38 thf(f14,plain,(
% 0.17/0.38 ! [X0 : $i > $o] : (? [X1] : (($true != (X0 @ (succ @ X1))) & ((X0 @ X1) = $true)) => (((X0 @ (succ @ (sK0 @ X0))) != $true) & ((X0 @ (sK0 @ X0)) = $true)))),
% 0.17/0.38 introduced(choice_axiom,[])).
% 0.17/0.38 thf(f12,plain,(
% 0.17/0.38 ! [X0 : $i > $o] : (? [X1] : (($true != (X0 @ (succ @ X1))) & ((X0 @ X1) = $true)) | ((X0 @ one) != $true) | ! [X2] : ((X0 @ X2) = $true))),
% 0.17/0.38 inference(flattening,[],[f11])).
% 0.17/0.38 thf(f11,plain,(
% 0.17/0.38 ! [X0 : $i > $o] : (! [X2] : ((X0 @ X2) = $true) | (? [X1] : (($true != (X0 @ (succ @ X1))) & ((X0 @ X1) = $true)) | ((X0 @ one) != $true)))),
% 0.17/0.38 inference(ennf_transformation,[],[f8])).
% 0.17/0.38 thf(f8,plain,(
% 0.17/0.38 ! [X0 : $i > $o] : ((! [X1] : (((X0 @ X1) = $true) => ($true = (X0 @ (succ @ X1)))) & ((X0 @ one) = $true)) => ! [X2] : ((X0 @ X2) = $true))),
% 0.17/0.38 inference(fool_elimination,[],[f7])).
% 0.17/0.38 thf(f7,plain,(
% 0.17/0.38 ! [X0 : $i > $o] : (((X0 @ one) & ! [X1] : ((X0 @ X1) => (X0 @ (succ @ X1)))) => ! [X2] : (X0 @ X2))),
% 0.17/0.38 inference(rectify,[],[f3])).
% 0.17/0.38 thf(f3,axiom,(
% 0.17/0.38 ! [X2 : $i > $o] : (((X2 @ one) & ! [X0] : ((X2 @ X0) => (X2 @ (succ @ X0)))) => ! [X1] : (X2 @ X1))),
% 0.17/0.38 file('/export/starexec/sandbox/tmp/tmp.iWCXoJdCP5/Vampire---4.8_20057',induction)).
% 0.17/0.38 thf(f25,plain,(
% 0.17/0.38 ( ! [X0 : $i] : (((succ @ X0) != sK1) | (sK1 = X0)) )),
% 0.17/0.38 inference(superposition,[],[f23,f22])).
% 0.17/0.38 thf(f22,plain,(
% 0.17/0.38 (sK1 = (succ @ sK1))),
% 0.17/0.38 inference(cnf_transformation,[],[f17])).
% 0.17/0.38 thf(f17,plain,(
% 0.17/0.38 (sK1 = (succ @ sK1))),
% 0.17/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f13,f16])).
% 0.17/0.38 thf(f16,plain,(
% 0.17/0.38 ? [X0] : ((succ @ X0) = X0) => (sK1 = (succ @ sK1))),
% 0.17/0.38 introduced(choice_axiom,[])).
% 0.17/0.38 thf(f13,plain,(
% 0.17/0.38 ? [X0] : ((succ @ X0) = X0)),
% 0.17/0.38 inference(ennf_transformation,[],[f5])).
% 0.17/0.38 thf(f5,negated_conjecture,(
% 0.17/0.38 ~! [X0] : ((succ @ X0) != X0)),
% 0.17/0.38 inference(negated_conjecture,[],[f4])).
% 0.17/0.38 thf(f4,conjecture,(
% 0.17/0.38 ! [X0] : ((succ @ X0) != X0)),
% 0.17/0.38 file('/export/starexec/sandbox/tmp/tmp.iWCXoJdCP5/Vampire---4.8_20057',satz2)).
% 0.17/0.38 thf(f23,plain,(
% 0.17/0.38 ( ! [X0 : $i,X1 : $i] : (((succ @ X0) != (succ @ X1)) | (X0 = X1)) )),
% 0.17/0.38 inference(cnf_transformation,[],[f18])).
% 0.17/0.38 thf(f18,plain,(
% 0.17/0.38 ! [X0,X1] : ((X0 = X1) | ((succ @ X0) != (succ @ X1)))),
% 0.17/0.38 inference(rectify,[],[f10])).
% 0.17/0.38 thf(f10,plain,(
% 0.17/0.38 ! [X1,X0] : ((X0 = X1) | ((succ @ X0) != (succ @ X1)))),
% 0.17/0.38 inference(ennf_transformation,[],[f9])).
% 0.17/0.38 thf(f9,plain,(
% 0.17/0.38 ! [X1,X0] : (((succ @ X0) = (succ @ X1)) => (X0 = X1))),
% 0.17/0.38 inference(rectify,[],[f2])).
% 0.17/0.38 thf(f2,axiom,(
% 0.17/0.38 ! [X1,X0] : (((succ @ X0) = (succ @ X1)) => (X0 = X1))),
% 0.17/0.38 file('/export/starexec/sandbox/tmp/tmp.iWCXoJdCP5/Vampire---4.8_20057',succ_injective)).
% 0.17/0.38 thf(f20,plain,(
% 0.17/0.38 ( ! [X2 : $i,X0 : $i > $o] : (((X0 @ (sK0 @ X0)) = $true) | ((X0 @ X2) = $true) | ((X0 @ one) != $true)) )),
% 0.17/0.38 inference(cnf_transformation,[],[f15])).
% 0.17/0.38 thf(f24,plain,(
% 0.17/0.38 (one != sK1)),
% 0.17/0.38 inference(superposition,[],[f19,f22])).
% 0.17/0.38 thf(f19,plain,(
% 0.17/0.38 ( ! [X0 : $i] : (((succ @ X0) != one)) )),
% 0.17/0.38 inference(cnf_transformation,[],[f1])).
% 0.17/0.38 thf(f1,axiom,(
% 0.17/0.38 ! [X0] : ((succ @ X0) != one)),
% 0.17/0.38 file('/export/starexec/sandbox/tmp/tmp.iWCXoJdCP5/Vampire---4.8_20057',one_is_first)).
% 0.17/0.38 % SZS output end Proof for Vampire---4
% 0.17/0.38 % (20167)------------------------------
% 0.17/0.38 % (20167)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.38 % (20167)Termination reason: Refutation
% 0.17/0.38
% 0.17/0.38 % (20167)Memory used [KB]: 5628
% 0.17/0.38 % (20167)Time elapsed: 0.016 s
% 0.17/0.38 % (20167)Instructions burned: 16 (million)
% 0.17/0.38 % (20167)------------------------------
% 0.17/0.38 % (20167)------------------------------
% 0.17/0.38 % (20166)Success in time 0.027 s
% 0.17/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------